Classification of security properties in a Linda-like process algebra
نویسندگان
چکیده
منابع مشابه
Classification of security properties in a Linda-like process algebra
We provide a classification of noninterference-based security properties for the formal analysis of secure information flow in concurrent and distributed systems. This is done in the setting of a process algebra modeling some Linda coordination primitives (asynchronous communication and read operation). For this purpose, we define relaxed notions of behavioural equivalence that take into accoun...
متن کاملProcess Algebra Contexts and Security Properties
A general framework for defining security properties is presented. It allows us to model many traditional security properties as well as to define new ones. The framework is based on process algebras contexts and processes relations. By appropriate choice of both of them we can model also probabilistic and quantified security properties.
متن کاملA Classiication of Security Properties for Process Algebras a Classification of Security Properties for Process Algebras 1
Several information ow security deenitions, proposed in the literature, are generalized and adapted to the model of labelled transition systems. This very general model has been widely used as a semantic domain for many process algebras , e.g. CCS. As a by-product, we provide a process algebra similar to CCS with a set of security notions, hence relating these two areas of concurrency research....
متن کاملA Classification of Security Properties
Several security definitions, proposed in the literature, are reformulated over the general model of labelled transition systems, frequently used as a suitable semantic domain for abstract concurrent languages, such as CCS. A classification of these security properties is provided. 1. This work has been partially supported by Esprit Basic research project BROADCAST n. 6360 and by Italian CNR gr...
متن کاملClassification of Security Properties
Many security properties of cryptographic protocols can be all formalized as specific instances of a general scheme, called Generalized Non Deducibility on Composition (GNDC ). This scheme derives from the NDC property we proposed a few years ago for studying information flow in computer systems. The theory is formulated for CryptoSPA, a process algebra we introduced for the specification of cr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 2006
ISSN: 0167-6423
DOI: 10.1016/j.scico.2005.07.010